Dihedral angles and orthogonal polyhedra

نویسندگان

  • Therese C. Biedl
  • Martin Derka
  • Stephen Kiazyk
  • Anna Lubiw
  • Hamideh Vosoughpour
چکیده

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle (i.e., the angle of a face at an incident vertex) is a multiple of π/2. Also, any dihedral angle (i.e., the angle between two planes that support to faces with a common edge) is a multiple of π/2. In this note we explore the converse: if the facial and/or dihedral angles are all multiples of π/2, is the polyhedron necessarily orthogonal? The case of facial angles was answered previously in two papers at CCCG 2002 [DO02, BCD02]: If a polyhedron with connected graph has genus at most 2, then facial angles that are multiples of π/2 imply that the polyhedron is orthogonal, while for genus 6 or higher there exist examples of non-orthogonal polyhedra with connected graph where all facial angles are π/2. In this note we show that if both the facial and dihedral angles are multiples of π/2 then the polyhedron is orthogonal (presuming connectivity), and we give examples to show that the condition for dihedral angles alone does not suffice.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

When can a graph form an orthogonal polyhedron?

Polyhedra are an important basic structure in computational geometry. One of the most beautiful results concerning polyhedra is Cauchy’s theorem, which states that a convex polyhedron is uniquely defined by its graph, edge lengths and facial angles. (See Section 2 for definitions.) The proof of Cauchy’s theorem (see e.g. [2]) unfortunately is nonconstructive, and the only known algorithm to rec...

متن کامل

Reconstruction of Orthogonal Polyhedra

In this thesis I study reconstruction of orthogonal polyhedral surfaces and orthogonal polyhedra from partial information about their boundaries. There are three main questions for which I provide novel results. The first question is “Given the dual graph, facial angles and edge lengths of an orthogonal polyhedral surface or polyhedron, is it possible to reconstruct the dihedral angles?” The se...

متن کامل

Vertex Configurations and Their Relationship on Orthogonal Pseudo-Polyhedra

Vertex configuration for a vertex in an orthogonal pseudo-polyhedron is an identity of a vertex that is determined by the number of edges, dihedral angles, and non-manifold properties meeting at the vertex. There are up to sixteen vertex configurations for any orthogonal pseudo-polyhedron (OPP). Understanding the relationship between these vertex configurations will give us insight into the str...

متن کامل

Cauchy's Theorem for Orthogonal Polyhedra of Genus 0

A famous theorem by Cauchy states that a convex polyhedron is determined by its incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhedra of genus 0 as long as no face has a hole. Our proof yields a linear-time algorithm to find the dihedral angles.

متن کامل

non-obtuse dihedral angles

Given a combinatorial description C of a polyhedron having E edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize C is generally not a convex subset of R [9]. If C has five or more faces, Andreev’s Theorem states that the corresponding space of dihedral angles AC obtained by restricting to non-obtuse angles is a convex polytope. In this paper we explain why Andre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1312.6824  شماره 

صفحات  -

تاریخ انتشار 2013